<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    257. Binary Tree Paths
   </h1>
   <p>
    Given a binary tree, return all root-to-leaf paths.
   </p>
   <p>
    <strong>
     Note:
    </strong>
    &nbsp;A leaf is a node with no children.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong>

   1
 /   \
2     3
 \
  5

<strong>Output:</strong> ["1-&gt;2-&gt;5", "1-&gt;3"]

<strong>Explanation:</strong> All root-to-leaf paths are: 1-&gt;2-&gt;5, 1-&gt;3
</pre>
  </div>
  <div>
   <h1 class="question_title">
    257. 二叉树的所有路径
   </h1>
   <p>
    给定一个二叉树，返回所有从根节点到叶子节点的路径。
   </p>
   <p>
    <strong>
     说明:
    </strong>
    &nbsp;叶子节点是指没有子节点的节点。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong>

   1
 /   \
2     3
 \
  5

<strong>输出:</strong> ["1-&gt;2-&gt;5", "1-&gt;3"]

<strong>解释:</strong> 所有根节点到叶子节点的路径为: 1-&gt;2-&gt;5, 1-&gt;3</pre>
  </div>
 </body>
</html>